Minimizing Total Communication Distance of Time-Step Optimal Broadcast in Mesh Networks
نویسندگان
چکیده
In this paper, we propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimension mesh. The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms can be generalized to a d-dimensional mesh or torus. TCD can potentially be used as a measurement for other types of collective communication operations.
منابع مشابه
Minimizing Total Communication Distance of a Time-Step Optimal Broadcast in Mesh Networks
In this paper, we propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimension mesh. The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms can be generalized to a d-dimensional mesh or torus. TCD can potentially be used as a measu...
متن کاملTime-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication Distance
In this paper we propose a new minimum total communication distance (TCD) algorithm and anoptimal TCD algorithm for broadcast in a 3-dimensional mesh (3-D mesh). The former generatesa minimum TCD from a given source node, and the latter guarantees a minimum TCD among allthe possible source nodes. These algorithms are based on a divide-and-conquer approach where a3-D mesh is ...
متن کاملEfficient All-to-All Broadcast in All-Port Mesh and Torus Networks
All-to-all communication is one of the most dense communication patterns and occurs in many important applications in parallel computing. In this paper, we present a new all-toall broadcast algorithm in all-port mesh and torus networks. Unlike existing all-to-all broadcast algorithms, the new algorithm takes advantage of overlapping of message switching time and transmission time, and achieves ...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملRouting and Broadcast Development for Minimizing Transmission Interruption in Multi rate Wireless Mesh Networks using Directional Antennas
Using directional antennas to reduce interference and improve throughput in multi hop wireless networks has attracted much attention from the research community in recent years. In this paper, we consider the issue of minimum delay broadcast in multi rate wireless mesh networks using directional antennas. We are given a set of mesh routers equipped with directional antennas, one of which is the...
متن کامل